Dynamic Search-space Pruning for T Recognitio
نویسندگان
چکیده
In automatic speech recognition complex state spaces are searched during the recognition process. By limiting these search spaces the computation time can be reduced, but unfortunately the recognition rate mostly decreases, too. However, especially for time-critical recognition tasks a search-space pruning is necessary. Therefore, we developed a dynamic mechanism to optimize the pruning parameters for time-constrained recognition tasks, e.g. speech recognition for robotic systems, in respect to word accuracy and computation time. With this mechanism an automatic speech recognition system can process speech signals with an approximately constant processing rate. Compared to a system without such a dynamic mechanism and the same time available for computation, the variance of the processing rate is decreased greatly without a significant loss of word accuracy. Furthermore, the extended system can be sped up to real-time processing, if desired or necessary.
منابع مشابه
Dynamic beam pruning strategy using adaptive control
In large vocabulary continuous speech recognition, huge search space results in vast computational cost. While most pruning search strategies can reduce the computation, but the recognition rate often decreases. This paper aims to reduce the computation time without any sacrifice of the recognition rate. By means of the adaptive control theory, a novel pruning method is presented. It can automa...
متن کاملSearch Space Pruning Based on Anticipated Path Recombination in LVCSR
In this paper we introduce a well-motivated abstract pruning criterion for LVCSR decoders based on the anticipated recombination of HMM state alignment paths. We show that several heuristical pruning methods common in dynamic network decoders are approximations of this pruning criterion. The abstract criterion is too complex to be applied directly in an efficient manner, so we derive approximat...
متن کاملCombining the Scalability of Local Search with the Pruning Techniques of Systematic Search
Systematic backtracking is used in many constraint solvers and combinatorial optimisation algorithms. It is complete and can be combined with powerful search pruning techniques such as branchand-bound, constraint propagation and dynamic variable ordering. However, it often scales poorly to large problems. Local search is incomplete, and has the additional drawback that it cannot exploit pruning...
متن کاملDynamic search-space pruning for time-constrained speech recognition
In automatic speech recognition complex state spaces are searched during the recognition process. By limiting these search spaces the computation time can be reduced, but unfortunately the recognition rate mostly decreases, too. However, especially for time-critical recognition tasks a search-space pruning is necessary. Therefore, we developed a dynamic mechanism to optimize the pruning paramet...
متن کاملPruning Heuristics for Path Sensitization in Test Pattern Generation
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay-fault testing. Path sensitization can be posed as a search, in the ndimensional Boolean space, for a consistent assignment of logic values to the circuit nodes which also satisfies a given condition. While the conditions for path sensit...
متن کامل